1527A - And Then There Were K - CodeForces Solution

bitmasks *800

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):

    n = int(input())

    b, res = bin(n)[2:], float('inf')
    n = len(b)

    for i in range(n):
        if b[i] == '1':
            c = "1" * i + "0" + "1" * (n - i - 1)
            res = min(res, int(c, 2))

    print(res)

C++ Code: 

#include<iostream>
#include<map>
#include<set>    
#include<iterator>
#include<algorithm>
#include<vector>
#include <unordered_set>
#include<cmath>
#include<iomanip>
#include<utility>
using namespace std;
int main() {
	int g; cin >> g; while (g--) {
		double n; cin >> n;
		long long int a = log2(n);
		cout <<fixed<<setprecision(0)<< pow(2, a) - 1 << endl;
	}
}


Comments

Submit
0 Comments
More Questions

901A - Hashing Trees
1283A - Minutes Before the New Year
1654D - Potion Brewing Class
1107B - Digital root
25A - IQ test
785A - Anton and Polyhedrons
1542B - Plus and Multiply
306A - Candies
1651C - Fault-tolerant Network
870A - Search for Pretty Integers
1174A - Ehab Fails to Be Thanos
1169A - Circle Metro
780C - Andryusha and Colored Balloons
1153A - Serval and Bus
1487C - Minimum Ties
1136A - Nastya Is Reading a Book
1353B - Two Arrays And Swaps
1490E - Accidental Victory
1335A - Candies and Two Sisters
96B - Lucky Numbers (easy)
1151B - Dima and a Bad XOR
1435B - A New Technique
1633A - Div 7
268A - Games
1062B - Math
1294C - Product of Three Numbers
749A - Bachgold Problem
1486B - Eastern Exhibition
1363A - Odd Selection
131B - Opposites Attract